Copernicus Project 0149 Encode Task 1.2 Porting Vital Debugging and Visualisation Tools to Pc E N C O D E Configuration Design in Clips -room Allocation Problem Connguration Design in Clips { Room Allocation Problem
نویسنده
چکیده
Document Reference: TR-Encode-TUKE-4-95 Date: 12/95 Activity: T1.2 Status: Internal Release Distribution: All ENCODE Partners Title: Configuration design in CLIPS room allocation problem Abstract: Experimental implementation of the room allocation problem by the use of the Complete-Revise-Optimize strategy in order to test the applicability of the CLIPS system to solve configuration design problems. Author(s): Marian Mach (TUKE)
منابع مشابه
Static Task Allocation in Distributed Systems Using Parallel Genetic Algorithm
Over the past two decades, PC speeds have increased from a few instructions per second to several million instructions per second. The tremendous speed of today's networks as well as the increasing need for high-performance systems has made researchers interested in parallel and distributed computing. The rapid growth of distributed systems has led to a variety of problems. Task allocation is a...
متن کاملAdaptive policy of buffer allocation and preventive maintenance actions in unreliable production lines
The buffer allocation problem is an NP-hard combinatorial optimization problem, and it is an important design problem in manufacturing systems. The research proposed in this paper concerns a product line consisting of n unreliable machines with n − 1 buffers and a preventive maintenance policy. The focus of the research is to obtain a better trade-off between the buffer level ...
متن کاملDCompose: A Tool for Measuring Data Decomposition on Distributed Memory Multiprocessors
In converting sequential programs for execution on distributed memory parallel processors, the programmer must determine the optimal data decomposition for the data structures. This task is an extremely complex optimisation problem and thus is usually performed manually. This chapter describes an X based visualisation tool called DCompose, which allows a programmer to measure the efficiency of ...
متن کاملSolving a Redundancy Allocation Problem by a Hybrid Multi-objective Imperialist Competitive Algorithm
A redundancy allocation problem (RAP) is a well-known NP-hard problem that involves the selection of elements and redundancy levels to maximize the system reliability under various system-level constraints. In many practical design situations, reliability apportionment is complicated because of the presence of several conflicting objectives that cannot be combined into a single-objective functi...
متن کاملUsing NSGA II Algorithm for a Three Objectives Redundancy Allocation Problem with k-out-of-n Sub-Systems
in the new production systems, finding a way to improving the product and system reliability in design is a very important. The reliability of the products and systems may improve using different methods. One of this methods is redundancy allocation problem. In this problem by adding redundant component to sub-systems under some constraints, the reliability improved. In this paper we worked on ...
متن کامل